Fuzzy Rewriting
نویسندگان
چکیده
-Rewriting systems are popular in end-user prcgramming because complex behavior can be described with few or no abstractions or variables. However, rewriting systems have been limited t o manipulating non-rotatable objects on a grid, such as in Agentsheets or Stageeast Creator. Systems that allow free-form movement of objects must use other techniques, such as the sequential programming by demonstration in Squeak. Viseuit is a new rewriting system that introduces fuzzy rewriting, which allows freely positioned and rotated objects t o interact using only rewriting rules. The result is a system that allows users to specify animations in a highly interactive way, without textual language or menu selections. Keyword$Visibility, Rewriting Systems, Rule-based Visual Language
منابع مشابه
Fuzzy Graph Rewritings
This paper presents fuzzy graph rewriting systems with fuzzy relational calculus. In this paper fuzzy graph means crisp set of vetices and fuzzy set of edges. We provide $\mathrm{f}\mathrm{u}\mathrm{z},7,\mathrm{y}$ relational calculus witll Heyting algebra. Formalizing rewriting system of fuzzy graphs it is important to $\mathrm{c}\cdot 1_{1\mathrm{t})\mathrm{t}}.\mathrm{q}\mathrm{C}1$ how to ...
متن کاملRewriting Fuzzy Graphs
This paper studies a fuzzy graph rewriting with single pushout approach from a viewpoint of fuzzy relational calculus. Two possible kinds of matchings for fuzzy graph rewritings are given, namely, a rigorous matching which just generalizes matchings for crisp (or ordinary) graph rewritings, and an "-matching which represents rather ambiguous or fuzzy one. Finally the pullback structure of fuzzy...
متن کاملA pragmatic approach to answering CQs over fuzzy DL-Lite-ontologies - introducing FLite
Fuzzy Description Logics (FDLs) generalize crisp ones by providing membership degree semantics. To offer efficient query answering for FDLs it is desirable to extend the rewriting-based approach for DL-Lite to its fuzzy variants. For answering conjunctive queries over fuzzy DL-LiteR ontologies we present an approach, that employs the crisp rewriting as a black-box procedure and treats the degre...
متن کاملConfluence and termination of fuzzy relations
Confluence and termination are essential properties connected to the idea of rewriting and substituting which appear in abstract rewriting systems. The aim of the present paper is to investigate confluence, termination, and related properties from the point of view of fuzzy logic leaving the ordinary notions a particular case when the underlying structure of truth degrees is two-valued Boolean ...
متن کاملControlled Fuzzy Parallel Rewriting
We study a Lindenmayer-like parallel rewriting system to model the growth of filaments (arrays of cells) in which developmental errors may occur. In essence this model is the fuzzy analogue of the derivation-controlled iteration grammar. Under minor assumptions on the family of control languages and on the family of fuzzy languages in the underlying iteration grammar, we show that (i) regular c...
متن کاملEmploying DL-LiteR-Reasoners for Fuzzy Query Answering
Fuzzy Description Logics generalize crisp ones by providing membership degree semantics for concepts and roles by fuzzy sets. Recently, answering of conjunctive queries has been investigated and implemented in optimized reasoner systems based on the rewriting approach for crisp DLs. In this paper we investigate how to employ such existing implementations for crisp query answering in DL-LiteR ov...
متن کامل